Generating Minimally Unsatisfiable Conjunctive Normal Forms
نویسندگان
چکیده
منابع مشابه
Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
Finding out that a SAT problem instance F is unsatisfiable is not enough for applications, where good reasons are needed for explaining the inconsistency (so that for example the inconsistency may be repaired). Previous attempts of finding such good reasons focused on finding some minimally unsatisfiable sub-clause-set F’ of F, which in general suffers from the non-uniqueness of F’ (and thus it...
متن کاملHomomorphisms of conjunctive normal forms
We study homomorphisms of propositional formulas in CNF generalizing symmetries considered by Krishnamurthy. If φ : H → F is a homomorphism, then unsatisfiability of H implies unsatisfiability of F . Homomorphisms from F to a subset F ′ of F (endomorphisms) are of special interest, since in such case F and F ′ are satisfiability-equivalent. We show that smallest subsets F ′ of a formula F for w...
متن کاملMinimally Unsatisfiable Boolean Circuits
Automated reasoning tasks in many real-world domains involve analysis of redundancies in unsatisfiable instances of SAT. In CNF-based instances, some of the redundancies can be captured by computing a minimally unsatisfiable subset of clauses (MUS). However, the notion of MUS does not apply directly to non-clausal instances of SAT, particularly those that are represented as Boolean circuits. In...
متن کاملModel-based Algorithm for Belief Revisions between Normal Conjunctive Forms
We consider a knowledge base (KB) K and a new information φ, both expressed in conjunctive form (CF), and present here, a novel, deterministic and correct algorithm for belief revision of φ in K. We denote our revision operator as: K′ = K ◦ φ. We introduce a novel logical binary operator Ind between two conjunctive forms, such that Ind(φ,K) generates also a conjunctive form. The operator Ind(φ,...
متن کاملGeneralizing Refinement Operators to Learn Prenex Conjunctive Normal Forms
Inductive Logic Programming considers almost exclusively universally quantied theories. To add expressiveness, prenex conjunctive normal forms (PCNF) with existential variables should also be considered. ILP mostly uses learning with refinement operators. To extend refinement operators to PCNF, we should first do so with substitutions. However, applying a classic substitution to a PCNF with exi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Mathematica Journal
سال: 2020
ISSN: 1097-1610
DOI: 10.3888/tmj.22-4